Bilevel Direct Search Method for Leader-Follower Equilibrium Problems and Applications
نویسندگان
چکیده
In the paper, we propose a bilevel direct search method for the distributed computation of equilibria in leader-follower problems. This type of direct search methods is designed for characterizing the decision making process where the players’ objective functions are not analytically available. We investigate the convergence of the accumulation points yielded by the method to the stationary points of the problems. Then, we apply the method to a health insurance problem and carry out several numerical examples to illustrate how the method performs when solving leader-follower problems.
منابع مشابه
A New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملMulti-follower linear bilevel programming: model and Kuhn-Tucker approach
The majority of research on bilevel programming has centered on the linear version of the problem in which only one leader and single follower are involved. This paper proposes a general model and Kuhn-Tucker approach for linear bilevel programming problems in which one leader and multiple follower(s) are involved, and there may (not) be sharing variables among the followers. Finally, a numeric...
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملModels and Algorithms for Fuzzy Multi-objective Multi-follower Linear Bilevel Programming in a Partial Cooperative Situation
Basic bilevel programming deals with hierarchical optimization problems in which the leader at the upper level attempts to optimize his/her objective, subject to a set of constraints and his/her follower’s solution, and the follower at the lower level tries to find an optimized strategy according to each of possible decisions made by the leader. Three issues may be involved in a basic bilevel d...
متن کامل